a(b(b(a(x1)))) → a(c(a(b(x1))))
a(c(x1)) → c(c(a(x1)))
c(c(c(x1))) → b(c(b(x1)))
↳ QTRS
↳ DependencyPairsProof
a(b(b(a(x1)))) → a(c(a(b(x1))))
a(c(x1)) → c(c(a(x1)))
c(c(c(x1))) → b(c(b(x1)))
A(b(b(a(x1)))) → A(c(a(b(x1))))
A(b(b(a(x1)))) → C(a(b(x1)))
A(c(x1)) → A(x1)
A(b(b(a(x1)))) → A(b(x1))
C(c(c(x1))) → C(b(x1))
A(c(x1)) → C(a(x1))
A(c(x1)) → C(c(a(x1)))
a(b(b(a(x1)))) → a(c(a(b(x1))))
a(c(x1)) → c(c(a(x1)))
c(c(c(x1))) → b(c(b(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
A(b(b(a(x1)))) → A(c(a(b(x1))))
A(b(b(a(x1)))) → C(a(b(x1)))
A(c(x1)) → A(x1)
A(b(b(a(x1)))) → A(b(x1))
C(c(c(x1))) → C(b(x1))
A(c(x1)) → C(a(x1))
A(c(x1)) → C(c(a(x1)))
a(b(b(a(x1)))) → a(c(a(b(x1))))
a(c(x1)) → c(c(a(x1)))
c(c(c(x1))) → b(c(b(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
A(b(b(a(x1)))) → A(c(a(b(x1))))
A(c(x1)) → A(x1)
A(b(b(a(x1)))) → A(b(x1))
a(b(b(a(x1)))) → a(c(a(b(x1))))
a(c(x1)) → c(c(a(x1)))
c(c(c(x1))) → b(c(b(x1)))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(b(b(a(x1)))) → A(b(x1))
Used ordering: Polynomial interpretation [25,35]:
A(b(b(a(x1)))) → A(c(a(b(x1))))
A(c(x1)) → A(x1)
The value of delta used in the strict ordering is 2.
POL(c(x1)) = x_1
POL(a(x1)) = 1/2 + x_1
POL(A(x1)) = (4)x_1
POL(b(x1)) = x_1
a(b(b(a(x1)))) → a(c(a(b(x1))))
a(c(x1)) → c(c(a(x1)))
c(c(c(x1))) → b(c(b(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
A(b(b(a(x1)))) → A(c(a(b(x1))))
A(c(x1)) → A(x1)
a(b(b(a(x1)))) → a(c(a(b(x1))))
a(c(x1)) → c(c(a(x1)))
c(c(c(x1))) → b(c(b(x1)))